Consensus String Problem for Multiple Regular Languages
نویسندگان
چکیده
The consensus string (or center string, closest string) of a set S of strings is defined as a string which is within a radius r from all strings in S. It is well-known that the consensus string problem for a finite set of equal-length strings is NP-complete. We study the consensus string problem for multiple regular languages. We define the consensus string of languages L1, . . . , Lk to be within distance at most r to some string in each of the languages L1, . . . , Lk. We also study the complexity of some parameterized variants of the consensus string problem. For a constant k, we give a polynomial time algorithm for the consensus string problem for k regular languages using additive weighted finite automata. We show that the consensus string problem for multiple regular languages becomes intractable when k is not fixed. We also examine the case when the length of the consensus string is given as part of input.
منابع مشابه
Problems Related to Shortest Strings in Formal Languages
In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for other problems involving languages. For example, the length of the shortest string accepted by a regular language provides a lower bound on the state complexity of the language. ...
متن کاملOn Upper and Lower Bounds on the Length of Alternating Towers
A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the other language, and each string can be embedded into the next string in the sequence. It is known that if there are towers of any length, then there also exists an infinite tower. We investigate upper and lower bounds o...
متن کاملVectorial Languages and Linear Temporal Logic
Determining for a given deterministic complete automaton the sequence of visited states while reading a given word is the core of important problems with automata-based solutions, such as approximate string matching. The main di3culty is to do this computation e3ciently. Considering words as vectors and working on them using vectorial operations allows to solve the problem faster than using loc...
متن کاملCompressed membership problems revisited
Membership problems for compressed strings in regular languages are investigated. Strings are represented by straight-line programs, i.e. contextfree grammars that generate exactly one string. For the representation of regular languages, various formalisms with different degrees of succinctness (e.g. suitably extended regular expressions, hierarchical automata) are considered. Precise complexit...
متن کاملDReX: A Declarative Language for Efficiently Computable Regular String Transformations
We present DReX, a declarative language that can express all regular string-to-string transformations, and yet can be evaluated efficiently. The class of regular string transformations has a robust theoretical foundation including multiple characterizations, closure properties, and decidable analysis questions, and admits a number of string operations such as insertion, deletion, substring swap...
متن کامل